M ar 2 00 6 STEINHAUS SETS AND JACKSON SETS

نویسنده

  • WILLIAM A. R. WEISS
چکیده

We prove that there does not exist a subset of the plane S that meets every isometric copy of the vertices of the unit square in exactly one point. We give a complete characterization of all three point subsets F of the reals such that there does not exists a set of reals S which meets every isometric copy of F in exactly one point.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steinhaus Sets and Jackson Sets

We prove that there does not exist a subset of the plane S that meets every isometric copy of the vertices of the unit square in exactly one point. We give a complete characterization of all three point subsets F of the reals such that there does not exists a set of reals S which meets every isometric copy of F in exactly one point.

متن کامل

On a Lattice Problem of H. Steinhaus

Sometime in the 1950’s, Steinhaus posed the following problem. Do there exist two sets A and S in the plane such that every set congruent to A has exactly one point in common with S? The trivial case where one of the sets is the plane and the other consists of a single point is ruled out. The first appearance of this problem in the literature seems to be in a 1958 paper of Sierpiński [14]. In t...

متن کامل

Determining groups from the clique structure in large social networks

Ethnographers have traditionally defined human groups as disjoint collections of individuals who are linked to each other by regular interaction, shared perceptions and affective ties. They are internally differentiated: some members occupy a central position in the group, others are on the periphery or somewhere in between. This way of characterising a group is intuitive to seasoned observers ...

متن کامل

A sufficient connectivity condition for generic rigidity in the plane

A graph G = (V,E) is said to be 6-mixed-connected if G−U−D is connected for all sets U ⊆ V and D ⊆ E which satisfy 2|U | + |D| ≤ 5. In this note we prove that 6-mixed-connected graphs are (redundantly globally) rigid in the plane. This improves on a previous result of Lovász and Yemini.

متن کامل

Developing High-Resolution Descriptions of Urban Heat Islands: A Public Health Imperative

Empirically derived 1-m–resolution descriptions of (A) morning and (B) evening urban heat islands in Portland, Oregon, on August 25, 2014. Temperatures were recorded in 1-hour periods at 6 AM and 7 PM. In the morning, low-lying vegetation cover had the strongest effect on temperature; in the evening, temperatures were most strongly affected by variation in building heights. High-resolution data...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006